package pro.softzhang.algo.lc1800;

public class LC1828_QueriesOnNumberOfPointsInsideACircle {
    public static void main(String[] args) {

    }

    static class Solution {
        public int[] countPoints(int[][] points, int[][] queries) {
            int[] answer = new int[queries.length];
            for (int i = 0; i < queries.length; i++) {
                answer[i] = 0;
                int[] circle = queries[i];
                for (int[] point : points) {
                    if (Math.pow(point[0] - circle[0], 2) + Math.pow(point[1] - circle[1], 2) <= circle[2] * circle[2]) {
                        answer[i]++;
                    }
                }
            }
            return answer;
        }
    }
}
